Approximate Verification of the Symbolic Dynamics of Markov Chains
نویسندگان
چکیده
منابع مشابه
A Approximate Verification of the Symbolic Dynamics of Markov Chains
A finite state Markov chain M can be regarded as a linear transform operating on the set of probability distributions over its node set. The iterative applications of M to an initial probability distribution μ0 will generate a trajectory of probability distributions. Thus a set of initial distributions will induce a set of trajectories. It is an interesting and useful task to analyze the dynami...
متن کاملApproximate Symbolic Model Checking of Continuous-Time Markov Chains
This paper presents a symbolic model checking algorithm for continuous-time Markov chains for an extension of the continuous stochastic logic CSL of Aziz et al 1]. The considered logic contains a time-bounded until-operator and a novel operator to express steady-state probabilities. We show that the model checking problem for this logic reduces to a system of linear equations (for unbounded unt...
متن کاملApproximate quantum Markov chains
This chapter reviews the concept of a Markov chain for random variables and then introduces a generalization to quantummechanical systems. We discuss the subtle differences between classical and quantumMarkov chains and point out difficulties that show up in the quantum case. Unlike the classical case that has been analyzed and understood well in the past, certain aspects of quantumMarkov chain...
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملVerification of Open Interactive Markov Chains
Interactive Markov chains (IMC) are compositional behavioral models extending both labeled transition systems and continuous-time Markov chains. IMC pair modeling convenience owed to compositionality properties with effective verification algorithms and tools owed to Markov properties. Thus far however, IMC verification did not consider compositionality properties, but considered closed systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 2015
ISSN: 0004-5411,1557-735X
DOI: 10.1145/2629417